Mechanisms for Opponent Modelling
نویسندگان
چکیده
In various competitive game contexts, gathering information about one’s opponent and relying on it for planning a strategy has been the dominant approach for numerous researchers who deal with what in game theoretic terms is known as the best response problem. This approach is known as opponent modelling. The general idea is given a model of one’s adversary to rely on it for simulating the possible ways based on which a game may evolve, so as to then choose out of a number of response options the most suitable in relation to one’s goals. Similarly, many approaches concerned with strategising in the context of dialogue games rely on such models for implementing and employing strategies. In most cases though, the methodologies and the formal procedures based on which an opponent model may be built and updated receive little attention, as they are usually left implicit. In this paper we assume a general framework for argumentationbased persuasion dialogue, and we rely on a logical conception of arguments—based on the recent ASPIC+ model for argumentation—to formally define a number of mechanisms based on which an opponent model may be built, updated, and augmented. 1998 ACM Subject Classification I.2. Computing Methodologies Artificial Intelligence
منابع مشابه
Safe Strategies for Agent Modelling in Games
Research in opponent modelling has shown success, but a fundamental question has been overlooked: what happens when a modeller is faced with an opponent that cannot be successfully modelled? Many opponent modellers could do arbitrarily poorly against such an opponent. In this paper, we aim to augment opponent modelling techniques with a method that enables models to be used safely. We introduce...
متن کاملSimilarity-based Opponent Modelling using Imperfect Domain Theories
This paper proposes a similarity-based approach for opponent modelling in multi-agent games. The classification accuracy is increased by adding derived attributes from imperfect domain theories to the similarity measure. The main contributions are to show how different forms of domain knowledge can be incorporated into similarity measures for opponent modelling, and to show that the situation s...
متن کاملThe Effectiveness of Opponent Modelling in a Small Imperfect Information Game Contents
Opponent modelling is an important issue in games programming today. Programs which do not perform opponent modelling are unlikely to take full advantage of the mistakes made by an opponent. Additionally, programs which do not adapt over time become less of a challenge to players, causing these players to lose interest. While opponent modelling can be a difficult challenge in perfect informatio...
متن کاملModel-based Opponent Modelling in Domains Beyond the Prisoner’s Dilemma
This paper examines the suitability of the model-based opponent modelling algorithm it-us-l* for domains beyond the prisoner’s dilemma it was initially designed for. An offline modelling framework is constructed where it-us-l* is used to create opponent models whose usage is deferred until a later point in time. This allows evaluation of the modelling procedure in a variety of abstract games – ...
متن کاملOpponent modelling for case-based adaptive game AI
In previous work we introduced a novel approach to adaptive game AI that was focussed on the rapid and reliable adaptation to game circumstances. We named the approach ‘case-based adaptive game AI’. In the approach, domain knowledge required to adapt to game circumstances is gathered automatically by the game AI, and is exploited immediately (i.e., without trials and without resource-intensive ...
متن کامل